CMPUT 651 Final Report HSMM : Heuristic Search with Meta - Models for Vision
نویسنده
چکیده
Adaptive image interpretation systems can learn optimal image interpretation policies for a given domain without human intervention. The policies are learned over an extensive generic image processing operator library. One of the principal weaknesses of the method lies with the large size of such libraries, which can make the machine learning process intractable. We demonstrate how evolutionary algorithms can be used to reduce the size of the operator library, thereby speeding up learning of the policy while still keeping human experts out of the development loop. Experiments in a challenging domain of forestry image interpretation exhibited a 95% reduction in the execution time, while maintaining the image interpretation accuracy of the full library. Adding seeding and elitism to our novel method serves to further improve the resulting operator sets.
منابع مشابه
A Monte Carlo-Based Search Strategy for Dimensionality Reduction in Performance Tuning Parameters
Redundant and irrelevant features in high dimensional data increase the complexity in underlying mathematical models. It is necessary to conduct pre-processing steps that search for the most relevant features in order to reduce the dimensionality of the data. This study made use of a meta-heuristic search approach which uses lightweight random simulations to balance between the exploitation of ...
متن کاملFORECASTING TRANSPORT ENERGY DEMAND IN IRAN USING META-HEURISTIC ALGORITHMS
This paper presents application of an improved Harmony Search (HS) technique and Charged System Search algorithm (CSS) to estimate transport energy demand in Iran, based on socio-economic indicators. The models are developed in two forms (exponential and linear) and applied to forecast transport energy demand in Iran. These models are developed to estimate the future energy demands based on pop...
متن کاملModeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کاملA Hybrid Meta-heuristic for the Dynamic Layout Problem with Transportation System Design
This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...
متن کاملAddressing the Freight Consolidation and Containerization Problem by Recent and Hybridized Meta-heuristic Algorithms
Nowadays, in global free market, third-party logistics providers (3PLs) are becoming increasingly important. Hence, this study aims to develop the freight consolidation and containerization problem, which consists of loading items into containers and then shipping these containers to different warehouse they are delivered to their final destinations. In order to handle the proposed problem, thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004